A monad measure space for logarithmic density
نویسندگان
چکیده
منابع مشابه
A Monad Measure Space for Logarithmic Density
We provide a framework for proofs of structural theorems about sets with positive Banach logarithmic density. For example, we prove that if A ⊆ N has positive Banach logarithmic density, then A contains an approximate geometric progression of any length. We also prove that if A,B ⊆ N have positive Banach logarithmic density, then there are arbitrarily long intervals whose gaps on A·B are multip...
متن کاملA Functional Language for Logarithmic Space
More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however effect the efficiency of the algorithms written in the languages. It is therefore important to understand how such choices effect the expressibility of programming languages. The paper pursues the very low complexity programs by ...
متن کاملLogarithmic density and logarithmic statistical convergence
In this paper we use the idea of logarithmic density to define the concept of logarithmic statistical convergence. We find the relations of logarithmic statistical convergence with statistical convergence, statistical summability (H, 1) introduced by Móricz (Analysis 24:127-145, 2004) and [H, 1]q-summability. We also give subsequence characterization of statistical summability (H, 1). MSC: 40A0...
متن کاملA Logarithmic Measure of Image Enhancement
Image enhancement performance is currently judged subjectively, with no reliable manner of quantifying the results of an enhancement. Current quantitative measures rely on linear algorithms to determine contrast, leaving room for improvement. With the introduction of more complex enhancement algorithms, there is a need for an effective method of quantifying performance to select optimal paramet...
متن کاملUnification and Logarithmic Space
We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof theory and more specifically linear logic and Geometry of Interaction. We show how unification can be used to build a model of computation by means of specific su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monatshefte für Mathematik
سال: 2016
ISSN: 0026-9255,1436-5081
DOI: 10.1007/s00605-016-0966-1